Monotonic subsequences in random sequences

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Subsequences of Sequences of Random Variables

Chatterji [2] has formulated the following heuristic principle: given any limit property for independent identically distributed random variables (i.i.d.r.v.'s), there exists an analogous property such that an arbitrary sequence of r.v.'s always has some subsequence possessing this analogous property. By 'arbitrary', we mean that no assumption concerning dependence is made, though it may be nec...

متن کامل

Counting monotonic subsequences in a data stream

We prove Ω(n) deterministic lower bounds for any streaming algorithm that exactly computes the number of inversions (2-dec-count) in a data stream of t elements where each element comes from [n] and t ≥ Ω(n). The proof uses a reduction argument and utilizes communication lower bounds for computation of disjointness. Our second result is Ω(n) lower bound on any algorithm that correctly computes ...

متن کامل

Monotonic subsequences in dimensions higher than one

The 1935 result of Erdős and Szekeres that any sequence of ≥ n +1 real numbers contains a monotonic subsequence of ≥ n+ 1 terms has stimulated extensive further research, including a paper of J. B. Kruskal that defined an extension of monotonicity for higher dimensions. This paper provides a proof of a weakened form of Kruskal’s conjecture for 2-dimensional Euclidean space by showing that there...

متن کامل

Heapable Sequences and Subsequences

Let us call a sequence of numbers heapable if they can be sequentially inserted to form a binary tree with the heap property, where each insertion subsequent to the first occurs at a previously placed number. In this paper we consider a variety of problems related to heapable sequences and subsequences that do not appear to have been studied previously. Our motivation for introducing these conc...

متن کامل

Detecting Linear Sequences and Subsequences†

Greenwood (1946), using an L2 distance, and others have addressed the question of detecting a too-linear fit of the occurrence times T0 < T1 < · · · < Tn of a sequence of random events. Two convenient distances are introduced here, then applied to the more challenging problem of detecting too-linear subsequences, where the multiple subsequence effect must be taken into account. Two interpretati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1975

ISSN: 0012-365X

DOI: 10.1016/0012-365x(75)90028-x